|
In Boolean logic, a formula for a Boolean function ''f'' is in Blake canonical form, also called the complete sum of prime implicants,〔Tsutomu Sasao, "Ternary Decision Diagrams and their Applications", in Tsutomu Sasao, Masahira Fujita, ''eds.'', ''Representations of Discrete Functions'' ISBN 0792397207, 1996, p. 278〕 the complete sum,〔Abraham Kandel, ''Foundations of Digital Logic Design'', p. 177〕 or the disjunctive prime form,〔Donald E. Knuth, ''The Art of Computer Programming'' 4A: ''Combinatorial Algorithms, Part 1'', 2011, p. 54〕 when it is a disjunction of all the prime implicants of ''f''.〔Frank Markham Brown, "The Blake Canonical Form", chapter 4 of ''Boolean Reasoning: The Logic of Boolean Equations'', ISBN 0486427854, 2nd edition, 2012, p. 77''ff'' (first edition, 1990)〕 Blake canonical form is a disjunctive normal form. The Blake canonical form is not necessarily minimal, however all the terms of a minimal sum are contained in the Blake canonical form.〔 It was introduced in 1937 by Archie Blake, who called it the "simplified canonical form";〔"Canonical expressions in Boolean algebra", Dissertation, Dept. of Mathematics, U. of Chicago, 1937, reviewed in J. C. C. McKinsey, ''The Journal of Symbolic Logic'' 3:2:93 (June 1938) 〕 it was named in honor of Blake by Frank Markham Brown in 1990.〔 Blake discussed three methods for calculating the canonical form: exhaustion of implicants, iterated consensus, and multiplication. The iterated consensus method was rediscovered by Samson and Mills, Quine, and Bing.〔 ==See also== * Horn clause 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Blake canonical form」の詳細全文を読む スポンサード リンク
|